On Curtis’ theorem about finite octonionic loops
نویسندگان
چکیده
منابع مشابه
on the commutativity degree in finite moufang loops
the textit{commutativity degree}, $pr(g)$, of a finite group $g$ (i.e. the probability that two (randomly chosen) elements of $g$ commute with respect to its operation)) has been studied well by many authors. it is well-known that the best upper bound for $pr(g)$ is $frac{5}{8}$ for a finite non--abelian group $g$. in this paper, we will define the same concept for a finite non--abelian textit{...
متن کاملThe Finite Bruck Loops *
We continue the work by Aschbacher, Kinyon and Phillips [AKP] as well as of Glauberman [Glaub1,2] by describing the structure of the finite Bruck loops. We show essentially that a finite Bruck loop X is the direct product of a Bruck loop of odd order with either a soluble Bruck loop of 2-power order or a product of loops related to the groups P SL2(q), q = 9 or q ≥ 5 a Fermat prime. The latter ...
متن کاملSteiner loops satisfying Moufang's theorem
A loop satisfies Moufang’s theorem whenever the subloop generated by three associating elements is a group. Moufang loops (loops that satisfy the Moufang identities) satisfy Moufang’s theorem, but it is possible for a loop that is not Moufang to nevertheless satisfy Moufang’s theorem. Steiner loops that are not Moufang loops are known to arise from Steiner triple systems in which some triangle ...
متن کاملA Quasi Curtis-Tits-Phan theorem for the symplectic group
We obtain the symplectic group Sp(V ) as the universal completion of an amalgam of low rank subgroups akin to Levi components. We let Sp(V ) act flag-transitively on the geometry of maximal rank subspaces of V . We show that this geometry and its rank ≥ 3 residues are simply connected with few exceptions. The main exceptional residue is described in some detail. The amalgamation result is then ...
متن کاملLocal Reasoning about While-Loops
Separation logic is an extension of Hoare logic that allows local reasoning. Local reasoning is a powerful feature that often allows simpler specifications and proofs. However, this power is not used to reason about while-loops. In this paper an inference rule is presented that allows using local reasoning to verify the partial correctness of while-loops. Instead of loop invariants this inferen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2007
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-07-08707-2